Some Decidable Congruences of Free Monoids
نویسندگان
چکیده
Let W be the free monoid over a finite alphabet A. We prove that a congruence of W generated by a finite number of pairs 〈au, u〉, where a ∈ A and u ∈ W , is always decidable.
منابع مشابه
Rational subsets of partially reversible monoids
A class of monoids that can model partial reversibility allowing simultaneously instances of two-sided reversibility, one-sided reversibility and no reversibility is considered. Some of the basic decidability problems involving their rational subsets, syntactic congruences and characterization of recognizability, are solved. Recognizability of rational subsets is also proved to be decidable for...
متن کاملInnnite Convergent String-rewriting Systems and Cross-sections for Monoids
A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...
متن کامل-torsion free Acts Over Monoids
In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general implies some other properties, respectively.
متن کاملSome Undecidability Results Related to the Star Problem in Trace Monoids
This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme from 1994 30, 31], we know that the Star Problem is decidable in trace monoids which do not contain a C4-submonoid. The C4 is (isomorphic to) the Cartesian Product of two free monoids o...
متن کاملThe Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids
We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
متن کامل